Zero-overhead Pr/T-Net execution

نویسندگان

  • Carsten Böke
  • Markus Hübel
  • Franz-Josef Rammig
  • Carsten Rust
چکیده

Petri Nets and higher order versions like Predicate Transition Nets (Pr/T-Nets) are very suitable for modeling event-oriented discrete and even parallel systems. Obviously, the next step is to implement the system code out of this model specification. Therefore, very efficient code has to be generated and a highly overhead free run-time environment is required. We propose a very tight integration of the Pr/T-Net execution into a customizable operating system that is optimal adapted for this purpose. Our approach is a very promising one towards direct and highly efficient implementations of Pr/T-Nets.

متن کامل
منابع مشابه

SoftPM: a software process management system reconciling formalism with easiness

Various formal approaches to process modeling and analysis have been proposed. With the emerging importance of practicality in this field, easiness in adopting formal technology should be taken into account. In this paper, we propose a PSEE called SoftPM that is based on a high level Petri net formalism for process modeling. To overcome the difficulty in using this formalism, SoftPM exploits a ...

متن کامل

7kh 3$5$',6( 'hvljq (qylurqphqw

State Machines formerly called Evolving Algebras [Gur95] combine declarative concepts of first-order logic with the abstract operational view of transition systems in a unifying framework for mathematical modeling of discrete dynamic systems. The underlying computation model constitutes a simple yet powerful semantic basis to deal with concurrent and reactive behavior in a direct and intuitive ...

متن کامل

A NEW PROOF OF THE PERSISTENCE PROPERTY FOR IDEALS IN DEDEKIND RINGS AND PR¨UFER DOMAINS

In this paper, by using elementary tools of commutative algebra,we prove the persistence property for two especial classes of rings. In fact, thispaper has two main sections. In the first main section, we let R be a Dedekindring and I be a proper ideal of R. We prove that if I1, . . . , In are non-zeroproper ideals of R, then Ass1(Ik11 . . . Iknn ) = Ass1(Ik11 ) [ · · · [ Ass1(Iknn )for all k1,...

متن کامل

Deterministic Measurement of Reliability and Performance Using Explicit Colored Petri Net in Business Process Execution Language and Eflow

Today there are many techniques for web service compositions. Evaluation of quality parameters has great impact on evaluation of final product. BPEL is one of those techniques that several researches have been done on its evaluation. However, there are few researches on evaluation of QoS in eflow. This research tries to evaluate performance and reliability of eflow and BPEL through mapping them...

متن کامل

Improving Speculative Thread-Level Parallelism Through Module Run-Length Prediction

Exploiting speculative thread-level parallelism across modules, e.g., methods, procedures, or functions, have shown promise. However, misspeculations and task creation overhead are known to adversely impact the speedup if too many small modules are executed speculatively. Our approach to reduce the impact of these overheads is to disable speculation on modules with a run-length below a certain ...

متن کامل

ذخیره در منابع من

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

متن کامل
عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000